منابع مشابه
Parallel On-Line Searching∗
We consider the problem where p searchers explore m > p half-lines, all joined at a common origin. The searchers travel at unit speed and the goal is to find a single object, or “exit” whose location is bounded away from the origin. We consider two minmax measures of effectiveness for a search strategy. The first is the worst case distancecompetitive ratio. This is the smallest value that excee...
متن کاملOn-Line Searching With Quagents
Three algorithms for on-line searching are implemented as Quagents and tested in the University of Rochester’s URQuake environment. RandomWalker selects directions at random, but will only turn completely around when no other options are available. WallHugger follows the wall on its right all the way around the maze. The final agent is based on Korf’s Learning Real-Time A* algorithm, which assi...
متن کاملOn-Line Searching in Simple Polygons
In this paper we study the problem of a robot searching for a visually recognizable target in an unknown simple polygon. We present two algorithms. Both work for arbitrarily oriented polygons. The search cost is proportional to the distance traveled by the robot. We use competitive analysis to judge the performance of our strategies. The rst one is a simple modiication of Djikstra's shortest pa...
متن کاملOn-Line Serial and Parallel String Searching
String searching is a pervasive primitive of computation. In on-line string searching, the text string is given in advance, but it is required that, as soon as one finishes reading a pattern, it must be possible to decide whether or not it occurs in the text. This paper surveys serial and parallel methods fOT on-line string searching. The auxiliary structures used aTe also suited to a host of o...
متن کاملOo-line Reasoning for On-line Eeciency: Knowledge Bases
The complexity of reasoning is a fundamental issue in AI. In many cases, the fact that an intelligent system needs to perform reasoning on-line contributes to the diiculty of this reasoning. This paper considers the case in which an intelligent system computes whether a query is entailed by the system's knowledge base. It investigates how an initial phase of oo-line preprocessing and design can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RadioGraphics
سال: 1993
ISSN: 0271-5333,1527-1323
DOI: 10.1148/radiographics.13.4.8356280